S-box

 ( Cryptographic Algorithms ) 

In cryptography, an S-box ( substitution-box) is a basic component of symmetric key algorithms which performs substitution. In , they are typically used to obscure the relationship between the key and the ciphertext, thus ensuring Claude Shannon property of confusion. Mathematically, an S-box is a nonlinear vectorial Boolean function.

In general, an S-box takes some number of input , m, and transforms them into some number of output bits, n, where n is not necessarily equal to m.

An m× n S-box can be implemented as a lookup table with 2 ^m words of n bits each. Fixed tables are normally used, as in the Data Encryption Standard (DES), but in some the tables are generated dynamically from the key (e.g. the Blowfish and the Twofish encryption algorithms).

---

Example One good example of a fixed table is the S-box from DES (S₅), mapping 6-bit input into a 4-bit output:

Given a 6-bit input, the 4-bit output is found by selecting the row using the outer two bits (the first and last bits), and the column using the inner four bits. For example, an input " 01101 1" has outer bits " 01" and inner bits "1101"; the corresponding output would be "1001".

---

Analysis and properties When DES was first published in 1977, the design criteria of its S-boxes were kept secret to avoid compromising the technique of differential cryptanalysis (which was not yet publicly known). As a result, research in what made good S-boxes was sparse at the time. Rather, the eight S-boxes of DES were the subject of intense study for many years out of a concern that a backdoor (a cryptanalysis known only to its designers) might have been planted in the cipher. As the S-boxes are the only nonlinear part of the cipher, compromising those would compromise the entire cipher.

The S-box design criteria were eventually published (in ) after the public rediscovery of differential cryptanalysis, showing that they had been carefully tuned to increase resistance against this specific attack such that it was no better than brute force. Biham and Shamir found that even small modifications to an S-box could significantly weaken DES. Gargiulo's "S-box Modifications and Their Effect in DES-like Encryption Systems" p. 9.

Any S-box where any linear combination of output bits is produced by a bent function of the input bits is termed a perfect S-box. RFC 4086. Section 5.3 "Using S-boxes for Mixing"

S-boxes can be analyzed using linear cryptanalysis and differential cryptanalysis in the form of a Linear approximation table (LAT) or Walsh transform and Difference Distribution Table (DDT) or autocorrelation table and spectrum. Its strength may be summarized by the nonlinearity (bent, almost bent) and differential uniformity (perfectly nonlinear, almost perfectly nonlinear).

---

See also

• Bijection, injection and surjection
• Boolean function
• Nothing-up-my-sleeve number
• Permutation box (P-box)
• Permutation cipher
• Rijndael S-box
• Substitution cipher

---

Further reading

• Bruce Schneier (1996). 9780471117094, John Wiley & Sons. . ISBN 9780471117094

• (2026). 9781538646496 ISBN 9781538646496

---

Sources

• (2013). 9783662047224, Springer Science & Business Media. . ISBN 9783662047224

---

External links

• A literature survey on S-box design
• John Savard's "Questions of S-box Design"
• "Substitution Box Design based on Gaussian Distribution"

Categories: Cryptographic Algorithms

Post Comment